全文获取类型
收费全文 | 12022篇 |
免费 | 1376篇 |
国内免费 | 918篇 |
专业分类
化学 | 716篇 |
晶体学 | 13篇 |
力学 | 946篇 |
综合类 | 327篇 |
数学 | 10617篇 |
物理学 | 1697篇 |
出版年
2024年 | 24篇 |
2023年 | 165篇 |
2022年 | 217篇 |
2021年 | 233篇 |
2020年 | 380篇 |
2019年 | 391篇 |
2018年 | 410篇 |
2017年 | 430篇 |
2016年 | 410篇 |
2015年 | 279篇 |
2014年 | 482篇 |
2013年 | 1015篇 |
2012年 | 532篇 |
2011年 | 686篇 |
2010年 | 646篇 |
2009年 | 847篇 |
2008年 | 850篇 |
2007年 | 736篇 |
2006年 | 781篇 |
2005年 | 630篇 |
2004年 | 563篇 |
2003年 | 458篇 |
2002年 | 473篇 |
2001年 | 378篇 |
2000年 | 361篇 |
1999年 | 298篇 |
1998年 | 242篇 |
1997年 | 230篇 |
1996年 | 174篇 |
1995年 | 184篇 |
1994年 | 120篇 |
1993年 | 113篇 |
1992年 | 92篇 |
1991年 | 54篇 |
1990年 | 71篇 |
1989年 | 50篇 |
1988年 | 37篇 |
1987年 | 35篇 |
1986年 | 30篇 |
1985年 | 31篇 |
1984年 | 33篇 |
1983年 | 13篇 |
1982年 | 26篇 |
1981年 | 11篇 |
1980年 | 13篇 |
1979年 | 9篇 |
1978年 | 14篇 |
1977年 | 17篇 |
1974年 | 9篇 |
1973年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
1.
2.
《Discrete Mathematics》2022,345(12):113083
Let G be a graph, the order of G, the connectivity of G and k a positive integer such that . Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets and is defined to be Hamiltonian-laceable if such that and for every pair of vertices and , there exists a Hamiltonian path in G with endpoints p and q, or and for every pair of vertices , there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition . Define to be a maximum integer such that and (1) for each non-empty subset S of X, if , then , and if , then ; and (2) for each non-empty subset S of Y, if , then , and if , then ; and (3) if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition such that and . In this paper, we show that if , then G is Hamiltonian-laceable; or if , then for every pair of vertices and , there is an -path P in G with . We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs. 相似文献
3.
4.
5.
6.
7.
Baoquan Zhou Daqing Jiang Bingtao Han Tasawar Hayat 《Mathematical Methods in the Applied Sciences》2022,45(1):423-455
Considering the effect of stochasticity including white noise and colored noise, this paper aims to study a hybrid stochastic cholera epidemic model with waning vaccine-induced immunity and nonlinear telegraph perturbations. First, we derive a critical value related to the basic reproduction number of the deterministic model. The key aim of this paper is to generalize the θ-stochastic criterion method proposed by the recent work (Han et al. in Chaos Solit Fract 140:110238, 2020) to eliminate nonlinear telegraph perturbations. Next, via constructing several θ-stochastic Lyapunov functions and using the generalized method, we further prove that the stochastic model have a unique ergodic stationary distribution under . Results show that the prevention and control of cholera epidemic depend on low transmission rate and small telegraph perturbations. Finally, the corresponding numerical simulations are performed to illustrate our analytical results and a practical application on the Somalia cholera outbreak is shown at the end of this paper. 相似文献
8.
Given a graph sequence denote by T3(Gn) the number of monochromatic triangles in a uniformly random coloring of the vertices of Gn with colors. In this paper we prove a central limit theorem (CLT) for T3(Gn) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T3(Gn), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7]. 相似文献
9.
10.